Recurrence of multiply-ended planar triangulations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planar Minimum-Weight Triangulations

The classic problem of nding a minimum-weight triangulation for a given planar straight-line graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data that suggest a logarithmic relationship between the number of input vertices and its running time in the aver...

متن کامل

Efficient Computation of Planar Triangulations

In 19] we introduced a new algorithm for computing planar triangulations of faceted surfaces for surface parameter-ization. Our algorithm computes a mapping that minimizes the distortion of the surface metric structures (lengths, angles, etc.). Compared with alternative approaches, the algorithm provides a signiicant improvement in robustness and applicability; it can handle more complicated su...

متن کامل

Symmetries of Unlabelled Planar Triangulations

We derive a decomposition scheme of unlabelled triangulations rooted at a single cell, where the decomposition depends on whether the automorphism group of the triangulation contains reflections, rotations, or both. Furthermore, the decomposition scheme is constructive in the sense that for each of the three cases, there is a k ∈ N such that the scheme defines a one-to-k correspondence between ...

متن کامل

Parallel ips on planar triangulations

In this paper, we analyze ips over triangulations. Given a convex quadrilateral divided into two triangles in the triangulation, a ip consists in removing the triangle and replacing them by the two whose common side is the opposite diagonal. A parallel ip is a series of ips on disjoint quadrilaterals performed at the same time. We analyze the number of parallel ips that are necessary to transfo...

متن کامل

Acute triangulations of double planar convex bodies

A (2-dimensional) double convex body 2K is a surface homeomorphic to the sphere consisting of two planar isometric compact convex bodies, K and K′, with boundaries glued in the obvious way. In this note we prove that, if K admits two perpendicular axes of symmetry and bdK satisfies a certain curvature condition, then 2K admits an acute triangulation of size 72. In particular, each double ellips...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Communications in Probability

سال: 2017

ISSN: 1083-589X

DOI: 10.1214/16-ecp4418